An Expressive Outerplanar Graph Pattern Class and its Efficient Pattern Matching Algorithm
نویسندگان
چکیده
An outerplanar graph is a planar graph which can be embedded in the plane in such a way that all of vertices lie on the outer boundary. Many chemical compounds are known to be expressed by outerplanar graphs. An externally extensible outerplanar graph pattern (eeo-graph pattern for short) represents a graph pattern common to a finite set of outerplanar graphs like a dataset of chemical compounds. The eeo-graph pattern can express a substructure common to blocks which appear in outerplanar graph structured data. In this paper, we propose a polynomial time algorithm of deciding whether or not a given eeo-graph pattern matches a given connected outerplanar graph.
منابع مشابه
Further results on strong edge-colourings in outerplanar graphs
An edge-colouring is strong if every colour class is an induced matching. In this work we give a formulae that determines either the optimal or the optimal plus one strong chromatic index of bipartite outerplanar graphs. Further, we give an improved upper bound for any outerplanar graph which is close to optimal. All our proofs yield efficient algorithms to construct such colourings.
متن کاملLWA 2006 Proceedings
In recent years there has been an increased interest in frequent pattern discovery in large databases of graph structured objects. While the frequent connected subgraph mining problem for tree datasets can be solved in incremental polynomial time, it becomes intractable for arbitrary graph databases. Existing approaches have therefore resorted to various heuristic strategies and restrictions of...
متن کاملA Polynomial-Time Algorithm for Computing the Maximum Common Connected Edge Subgraph of Outerplanar Graphs of Bounded Degree
The maximum common connected edge subgraph problem is to find a connected graph with the maximum number of edges that is isomorphic to a subgraph of each of the two input graphs, where it has applications in pattern recognition and chemistry. This paper presents a dynamic programming algorithm for the problem when the two input graphs are outerplanar graphs of a bounded vertex degree, where it ...
متن کاملFirst-class patterns
Pure pattern calculus supports pattern-matching functions in which patterns are first-class citizens that can be passed as parameters, evaluated and returned as results. This new expressive power supports two new forms of polymorphism. Path polymorphism allows recursive functions to traverse arbitrary data structures. Pattern polymorphism allows patterns to be treated as parameters which may be...
متن کاملMining of Frequent Block Preserving Outerplanar Graph Structured Patterns
An outerplanar graph is a planar graph which can be embedded in the plane in such a way that all of vertices lie on the outer boundary. Many semi-structured data like the NCI dataset having about 250,000 chemical compounds can be expressed by outerplanar graphs. In this paper, we consider a data mining problem of extracting structural features from semi-structured data like the NCI dataset. For...
متن کامل